Statistical Behaviors of Distributed Transition Planning
نویسندگان
چکیده
The transition planning problem is to move a system from an existing starting configuration to a desired final configuration at the lowest possible cost. Prior work shows that the transition planning problem can be reduced to a bipartite matching problem and the stable marriage algorithm can be used to approximate a minimum cost transition in a distributed environment. In this paper, we study the efficiency of this mapping, including its best-case, worst-case, and statistical behavior. We discuss the relationship between algorithm performance and the distribution of the input data. We show that while there are cases in which this algorithm performs poorly, works well when the costs of transitioning between distributed resources follow a normal distribution. We discuss the applicability of this algorithm to real-world situations in which resources are thus distributed.
منابع مشابه
The Common Prototyping Environment: A Framework for Technology Integration, Evaluation and Transition
The ARPA/Rome Laboratory Planning and Scheduling Initiative was organized, in part, around a Common Prototyping Environment (CPE), established to promote experiments involving the integration of planning-related software systems. It included a repository containing contributed software available for sharing and reuse, domain information and sample problems, knowledge representation tools, useri...
متن کاملAn assessment of the current status of the organizational structure and its dimensions in medical universities for transition to the third generation university
Background: In today's competitive world, it is hardly possible to achieve strategic goals without having a well-structured organization. Therefore, universities need to focus on improving their organizational structure in order to achieve their goals and sustain their activities. The purpose of this study was to assess the current status of organizational structure dimensions in universities o...
متن کاملDistributed Coordination Architecture for Cooperative Task Planning and Execution of Intelligent Multi-Robot Systems
This chapter provides a practical and intuitive way of cooperative task planning and execution for complex robotic systems using multiple robots in automated manufacturing applications. In large-scale complex robotic systems, because individual robots can autonomously execute their tasks, robotic activities are viewed as discrete event-driven asynchronous, concurrent processes. Further, since r...
متن کاملA Game Theoretic Approach for Sustainable Power Systems Planning in Transition
Intensified industrialization in developing countries has recently resulted in huge electric power demand growth; however, electricity generation in these countries is still heavily reliant on inefficient and traditional non-renewable technologies. In this paper, we develop an integrated game-theoretic model for effective power systems planning thorough balancing between supply and demand for e...
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کامل